Locating Faults in Tree-Structured Networks
نویسندگان
چکیده
An important problem in fault diagnosis is how to locate faulty components by analysing performance measurements from those components. In this paper, we present an algorithm that uses the informationtheoretic Minimum Message Length (MML) principle to locate faults in tree-structured networks. Treestructured networks are an important application for fault diagnosis due to their use as distribution networks in telecommunication and power industries. The main advantage of using a MML approach is that we can model both the complexity of an explanation for a set of measurements, as well as the accuracy of the explanation. We demonstrate the effectiveness of this approach through an empirical evaluation on a range of simulated data.
منابع مشابه
Reliability and Availability Evaluation of Wireless Sensor Networks for Industrial Applications
Wireless Sensor Networks (WSN) currently represent the best candidate to be adopted as the communication solution for the last mile connection in process control and monitoring applications in industrial environments. Most of these applications have stringent dependability (reliability and availability) requirements, as a system failure may result in economic losses, put people in danger or lea...
متن کاملNeural Network Based Fault Detection & Classification for Transmission Lines
This Paper focuses on detecting, classifying and locating faults on electric power transmission lines. Fault detection, fault classification and fault location have been achieved by using artificial neural networks. Feedforward networks have been employed along with backpropagation algorithm for each of the three phases in the Fault location process. Analysis on neural networks with varying num...
متن کاملمکان یابی خطا در شبکه های توزیع فشار متوسط دو مداره به روش امپدانسی
Power distribution feeders contains many laterals, sub-laterals, different number of circuit line, load taps, balanced and unbalanced load, different type of lines (cable or overhead), different cross-sections and numerous distribution transformers with different capacities. Moreover, the voltage and current are measured only at the beginning of the feeder. Thus, fault location is very complex....
متن کاملOptimally Locating a Structured Facility of a Specified Length in a Weighted Tree Network
including the one proposed in [5]. Minieka showed that all the eight problems can be solved in polynomial time except the one of finding the maximum distancesum tree of a specified length, which was proved to be NP-hard later in [8]. Recently, in [6,7], Peng and Lo have proposed efficient parallel algorithms on the EREW PRAM for optimally locating in a tree network a path and a tree of a specif...
متن کاملFault Identification using end-to-end data by imperialist competitive algorithm
Faults in computer networks may result in millions of dollars in cost. Faults in a network need to be localized and repaired to keep the health of the network. Fault management systems are used to keep today’s complex networks running without significant cost, either by using active techniques or passive techniques. In this paper, we propose a novel approach based on imperialist competitive alg...
متن کامل